Dense-choice Counter Machines revisited

نویسندگان

  • Florent Bouchy
  • Alain Finkel
  • Pierluigi San Pietro
چکیده

This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of ”Dense Counter Machines” so that it now extends (discrete) Counter Machines, and we provide new undecidability and decidability results. Using the first-order additive mixed theory of reals and integers, we give a logical characterization of the sets of configurations reachable by reversal-bounded Dense-choice Counter Machines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finkel , Alain and Sangnier , Arnaud Reversal - bounded counter machines revisited Research Report LSV - 08 - 33 December 2008

We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this p...

متن کامل

Reversal-Bounded Counter Machines Revisited

We extend the class of reversal-bounded counter machines by authorizing a finite number of alternations between increasing and decreasing mode over a given bound. We prove that extended reversal-bounded counter machines also have effective semi-linear reachability sets. We also prove that the property of being reversal-bounded is undecidable in general even when we fix the bound, whereas this p...

متن کامل

One-Reversal Counter Machines and Multihead Automata: Revisited

We investigate the power of (1-reversal) counter machines (finite automata with multiple counters, where each counter can ‘‘reverse’’ only once, i.e., once a counter decrements, it can no longer increment) and one-way multihead finite automata (finite automata with multiple one-way input heads) as a language acceptor. They can be non-deterministic as well as augmented with a pushdown stack. Fir...

متن کامل

بررسی ضرورت کنترل کیفی دستگاههای شمارنده سلول های خونی در آزمایشگاههای تشخیص طبی

Background and aim:Blood cells have an important role in human healthy, so their shapes and numbers are defined as human healthy indexes. These factors are measured by cell counter machines. Presenting a high quality report according to cell counters output is dependant on their operational accuracy. Therefore it was necessary to do a study on quality control of blood cell counter machines in s...

متن کامل

Dense Counter Machines and Verification Problems

We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and tested for zero) by allowing the machine the additional ability to increment/decrement each counter Ci by a nondeterministically chosen fractional amount δi between 0 and 1 (δi may be different at each step). Further at...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 542  شماره 

صفحات  -

تاریخ انتشار 2014